Reducing the Space Requirement of Suux Trees
نویسنده
چکیده
We show that suux trees store various kinds of redundant information. We exploit these redundancies to obtain more space eecient representations. The most space eecient of our representations requires 20 bytes per input character in the worst case, and 10:1 bytes per input character on average for a collection of 42 les of diierent type. This is an advantage of more than 8 bytes per input character over previous work. Our representations can be constructed as eeciently as previous representations, and the asymptotic running times of suux tree applications are retained.
منابع مشابه
Space Eecient Suux Trees
We give the rst representation of a suux tree that uses n lg n + O(n) bits of space and supports searching for a pattern string in the given text (from a xed size alphabet) in O(m) time, where n is the size of the text and m is the length of the pattern. The structure is quite simple and answers a question raised by Muthukrishnan in 22]. Previous compact representations of suux trees had either...
متن کاملAn experimental study of SB-trees
In a previous work of ours 13], we proposed a text indexing data structure for external memory, which we called SB-tree, that combines the best B-tree and suux array qualities to overcome the limitations of inverted les, suux arrays, suux trees, and preex B-trees. In this paper, we study the performance of SB-trees in a practical setting by running a large number of searching and updating exper...
متن کاملFrom Ukkonen to Mccreight and Weiner: a Unifying View of Linear-time Suux Tree Construction
We review the linear time suux tree constructions by Weiner, McCreight, and Ukkonen. We use the terminology of the most recent algorithm, Ukkonen's online construction, to explain its historic predecessors. This reveals relationships much closer than one would expect, since the three algorithms are based on rather diierent intuitive ideas. Moreover, it completely explains the diierences between...
متن کاملSuux Binary Search Trees and Suux Arrays
Suux arrays and suux binary search trees are two data structures that have been proposed as alternatives to the classical suux tree to facilitate eecient on-line string searching. Here, we explore the relationship between these two structures. In particular, we present an alternative view of a suux array, with its auxiliary information, as a perfectly balanced suux binary search tree, and descr...
متن کاملCompact Suux Array ?
Suux array is a data structure that can be used to index a large text le so that queries of its content can be answered quickly. Basically a suux array is an array of all suuxes of the text in the lexico-graphic order. Whether or not a word occurs in the text can be answered in logarithmic time by binary search over the suux array. In this work we present a method to compress a suux array such ...
متن کامل